Hash-Like Fractal Image Compression with Linear Execution Time
نویسندگان
چکیده
The main computational cost in Fractal Image Analysis (FIC) comes from the required range-domain full block comparisons. In this work we propose a new algorithm for this comparison, in which actual full block comparison is preceded by a very fast hash–like search of those domains close to a given range block, resulting in a performance linear with respect to the number of pixels. Once the algorithm is detailed, its results will be compared against other state–of–the–art methods in FIC.
منابع مشابه
A Fast Fractal Image Compression Algorithm Combined with Graphic Processor Unit
Directed against the characteristics of computational intensity of fractal image compression encoding, a serial-parallel transfer mechanism is built for encoding procedures. By utilizing the properties of single instruction and multithreading execution of compute unified device architecture (CUDA), the parallel computational model of fractal encoding is built on the graphic processor unit (GPU)...
متن کاملFractal Image Compression Self-Similarity via Locality Sensitive Hashing
In this paper I describe a Haskell implementation of fractal image compression, a lossy image compression technique that leverages self-similarity within an image to produce an encoding. Known for its lengthy encoding time, fractal image encoding implementations require the most cleverness in identifying highly self-similar image regions. In this paper, I describe a simple locality sensitive ha...
متن کاملHybrid Fractal/Wavelet Image Compression in a High Performance Computing Environment
We propose new hybrid fractal/wavelet image compression algorithms which combine both schemes in the spatial and the transform domain. Whereas traditional fractal compression algorithms suuer from enormous execution times, the proposed algorithms exhibit a smaller and more predictable computational comlexity. We propose strategies for executing these algorithms on MIMD high performance computer...
متن کاملA Novel Algorithm for Image Compression Based On Fractal and Neural Networks
Fractal image compression technique which excludes the similarities between different regions of the image takes long time for encoding. An artificial intelligence technique like neural network is used to reduce the search space and encoding time for the MRI images with an algorithm called as back propagation neural network algorithm. Initially, MRI image is divided into ranges and domains of f...
متن کاملOptimization of Fractal Image Compression Based on Genetic Algorithms
The main problem of all fractal compression implementations is the execution time. The algorithms can spend hours and hours to compress a single image. So the major variants of the standard algorithm were proposed to speed up computation time. But most of them lead to a bad quality, or a lower compression ratio. For example, the Fisher’s proposed classification pattern has greatly accelerated t...
متن کامل